Computable de Finetti measures

نویسندگان

  • Cameron E. Freer
  • Daniel M. Roy
چکیده

We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes in probabilistic functional programming languages can be automatically rewritten as procedures that do not modify non-local state. Along the way, we prove that a distribution on the unit interval is computable if and only if its moments are uniformly computable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computable Exchangeable Sequences Have Computable de Finetti Measures

We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably recovering a distribution from its sequence of moments, which suffices to prove the theorem in the case of (almost surely) continuous directing random measures. In the general case, we give a proof inspired by a randomized algori...

متن کامل

Conditional distributions, exchangeable particle systems, and stochastic partial differential equations

Stochastic partial differential equations (SPDEs) whose solutions are probabilitymeasure-valued processes are considered. Measure-valued processes of this type arise naturally as de Finetti measures of infinite exchangeable systems of particles and as the solutions for filtering problems. In particular, we consider a model of asset price determination by an infinite collection of competing trad...

متن کامل

Convergence of SDP hierarchies for polynomial optimization on the hypersphere

We show how to bound the accuracy of a family of semi-definite programming relaxations for the problem of polynomial optimization on the hypersphere. Our method is inspired by a set of results from quantum information known as quantum de Finetti theorems. In particular, we prove a de Finetti theorem for a special class of real symmetric matrices to establish the existence of approximate represe...

متن کامل

Nonconglomerability for countably additive Measures that are not κ-additive

Let κ be an uncountable cardinal. Using the theory of conditional probability associated with de Finetti (1974) and Dubins (1975), subject to several structural assumptions for creating sufficiently many measurable sets, and assuming that κ is not a weakly inaccessible cardinal, we show that each probability that is not κ-­‐ additive has conditional probabilities that fail to be conglomerable i...

متن کامل

A simple proof of Renner’s exponential de Finetti theorem

In quantum information theory a de Finetti theorem expresses the fact that a quantum state ρ ∈ (Cd)⊗n that is invariant under permutation of its n subsystems is close to a mixture of tensor product states. The first such result is due to de Finetti [3], who showed that any classical distribution that is infinitely exchangeable can be expressed as a convex combination of product distributions. M...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 163  شماره 

صفحات  -

تاریخ انتشار 2012